Attribute Reduction and Information Granularity
نویسنده
چکیده
This work was supported by Science and Technology Commission of Shanghai Municipality, No.705931 ABSTRACT In the view of granularity, this paper analyzes the influence of three attribute reducts on an information system, finding that the possible reduct and − μ decision reduct will make the granule view coarser, while discernible reduct will not change the granule view. In addition, we investigate the combination of reducts from two partial information systems in parallel or in incremental data mining and urge that the union of partial possible reducts can be regarded as a possible reduct for union of partial information systems.
منابع مشابه
A Continuous Information Attribute Reduction Algorithm Based on Hierarchical Granulation
The attribute reduction algorithms based on neighborhood approximation usually use the distance as the approximate metric. Algorithms could result in the loss of information with the same distance threshold to construct the neighborhood families of different dimension spaces. Thereby, an attribute reduction algorithm based on hierarchical granulation is proposed. This algorithm can reduce redun...
متن کاملAttribute Granulation Based on Attribute Discernibility and AP Algorithm
For high dimensional data, the redundant attributes of samplers will not only increase the complexity of the calculation, but also affect the accuracy of final result. The existing attribute reduction methods are encountering bottleneck problem of timeliness and spatiality. In order to looking for a relatively coarse attributes granularity of problem solving, this paper proposes an efficient at...
متن کاملResearch on Granular Computing Approach in Rough Set
Granulation of information appears in many areas, such as machine learning, evidence theory, and data mining. Granular computing is the core research field in granulation of information. It is an effective tool for complex problem, massive data mining and fuzzy information processing. In the basis of principle of granularity, we aim to study the granular decomposing method in granules space bas...
متن کاملConsidering Uncertainty in Modeling Historical Knowledge
Simplifying and structuring qualitatively complex knowledge, quantifying it in a certain way to make it reusable and easily accessible are all aspects that are not new to historians. Computer science is currently approaching a solution to some of these problems, or at least making it easier to work with historical data. In this paper, we propose a historical knowledge representation model takin...
متن کاملFeature Selection in Decision Systems Based on Conditional Knowledge Granularity
Feature selection is an important technique for dimension reduction in machine learning and pattern recognition communities. Feature evaluation functions play essential roles in constructing feature selection algorithms. This paper introduces a new notion of knowledge granularity, called conditional knowledge granularity, reflecting relationship between conditional attributes and decision attri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003